package leetcode_core.leetcode_2;

import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

public class Exist {

    public boolean exist(char[][] board, String word) {
        return true;
    }


    //回溯法求解(路径,选择列表)
    private void dfs(char[][] board,String word,int x,int y,int index){
        if(index == word.length()){
            return;
        }

    }




}
